Sparse discretization of sparse control problems
نویسندگان
چکیده
منابع مشابه
Consistent Discretization of Linear Inverse Problems using Sparse Stochastic Processes
We introduce a novel discretization paradigm and specify MAP estimators for linear inverse problems by using the theory of continuous-domain sparse stochastic processes. We characterize the complete class of admissible priors for the discretized version of the signal and show that the said class is restricted to the family of infinitely divisible distributions. We also explain the connections b...
متن کاملA Priori Error Analysis for Discretization of Sparse Elliptic Optimal Control Problems in Measure Space
In this paper an optimal control problem is considered, where the control variable lies in a measure space and the state variable fulfills an elliptic equation. This formulation leads to a sparse structure of the optimal control. In this setting we prove a new regularity result for the optimal state and the optimal control. Moreover, a finite element discretization based on [E. Casas, C. Clason...
متن کاملSparse Tensor Discretization of Elliptic sPDEs
We propose and analyze sparse deterministic-stochastic tensor Galerkin finite element methods (sparse sGFEMs) for the numerical solution of elliptic partial differential equations (PDEs) with random coefficients in a bounded physical domain D ⊂ R. The sparse sGFEMs are based on a separation of stochastic and deterministic input variables by Karhunen-Loève expansion of the random diffusion coeff...
متن کاملOn Sparse Discretization for Graphical Games
This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixe...
متن کاملSparse Parameterized Problems
Sparse languages play an important role in classical structural complexity theory. In this paper we introduce a natural definition of sparse problems for parameterized complexity theory. We prove an analog of Mahaney’s theorem: there is no sparse parameterized problem which is hard for the tth level of the W hierarchy, unless the W hierarchy itself collapses up to level t. The main result is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2019
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.201900105